//
// Created by TNJ on 2021/6/8.
//

#ifndef CONVERT_LIST_LIST_OPT_H
#define CONVERT_LIST_LIST_OPT_H

#include "list.h"
#include <stdbool.h>

extern list_t *convert_list(list_t *list);   //翻转链表
extern list_t *get_last_k_node(list_t *list, int k);  //获取倒数第K个结点
extern bool is_there_a_ring(list_t *list);  //判断链表是否有环
extern list_t *transfer_to_ring_list(list_t *list);  //将单链表转成环形链表

#endif //CONVERT_LIST_LIST_OPT_H
